Correctness Issues in Transformational Re nement
نویسندگان
چکیده
Transformational re nement in the context of this talk refers to the automatic transformation of a speci cation expressed in a functional programming language typically SML LISP or Miranda to an e cient implementation expressed in an imperative programming language typically FORTRAN or one of its parallel derivitives In particular our work focuses on the derivation of e cient numerical mathematical algorithms for execution on a range of parallel machines A transformational derivation proceeds not as a monolithic translation process c f compi lation but rather as a sequence of sub derivations which convert a program via a number of intermediate forms which lie between its speci cation expressed in a speci cation lan guage and its implementation expressed in the target language For example rather than being translated directly from SML to Fortran a speci cation may rst be converted to the notation then into Fortran
منابع مشابه
Context handling in the Re nement Calculus framework
We describe two approaches for context handling in the Re nement Calculus framework They show how information relevant for total correctness can be transported from one place of a program to another and then used for re ne ment of program components Both approaches have been formalised in the HOL theorem proving system and integrated into a tool for transformational reasoning about programs TUC...
متن کاملMechanising Procedures in HOL
In this paper we present an approach for modelling procedures (as they occur in imperative programs) in a weakest precondition semantics. We show how this approach can be implemented in the mechanisation of the re nement calculus theory in the HOL system. That makes it possible to derive a number of correctness and re nement properties of procedures. Finally, we show how our method for procedur...
متن کاملTransformations in High-level Synthesis: Formal Speciication and Eecient Mechanical Veriication
Dependency graphs are used to model data and control ow in hardware and software design. In high-level synthesis of hardware, optimization and re nement transformations are used to transform dependency-graph-based speci cations at the behavior level to dependency-graph-based implementations at the register-transfer level. Registertransfer-level implementations are mapped to gate-level hardware ...
متن کاملA Language of Re nements
The re nement calculus is a formal technique for the development of programs which are provably correct with respect to their speci cations. A formal language is presented for the description of program development using the re nement calculus. The language provides an abstract representation of the overall program development, re ecting its tree-like structure. The language is used for recordi...
متن کاملArchitecture Re nement
|A method is presented for the stepwise re nement of an abstract architecture into a relatively correct lower-level architecture that is intended to implement it. A re nement step involves the application of a prede ned renement pattern that provides a routine solution to a standard architectural design problem. A pattern contains an abstract architecture schema and a more detailed schema inten...
متن کامل